Focusing Search in Multiobjective Evolutionary Optimization through Preference Learning from User Feedback
نویسندگان
چکیده
The problem of computing the set of Pareto-optimal solutions in multiobjective optimization has been tackled by means of different approaches in previous years, including evolutionary algorithms. A key advantage of computing the whole set of Pareto-optimal solutions is completeness: None of the solutions that might be maximally preferred by the user is lost. An obvious disadvantage, however, is the computational effort, which may become prohibitive for high-dimensional problems. Besides, the resulting set itself may become rather large, making it impracticable to present the entire set to the user. In order to mitigate these problems, we propose a method for incorporating user-feedback in the optimization process by asking the user for pairwise preferences. The pairwise preferences thus produced are then used as training examples for a preference learning method leading to a hypothetical utility model that approximate the true but unknown (latent) utility function of the user. This model is used to focus the search on the most promising parts of the Pareto front, which is approximated by an evolutionary algorithm.
منابع مشابه
Learning to diversify in complex interactive Multiobjective Optimization
Many real-world problems have a natural formulation as Multiobjective Optimization Problems (MOPs), in which multiple conflicting objectives need to be simultaneously optimized. A popular approach to deal with the resulting complexity consists of interacting with the Decision Maker (DM) during optimization, progressively focusing towards her preferred area in the decision space. In BC-EMO, an e...
متن کاملConsideration of Partial User Preferences in Evolutionary Multiobjective Optimization
Evolutionary multiobjective optimization usually attempts to find a good approximation to the complete Pareto optimal front. However, often the user has at least a vague idea about what kind of solutions might be preferred. If such information is available, it can be used to focus the search, yielding a more fine-grained approximation of the most relevant (from a user’s perspective) areas of th...
متن کاملSPAM: Set Preference Algorithm for Multiobjective Optimization
This paper pursues the idea of a general multiobjective optimizer that can be flexibly adapted to arbitrary user preferences— assuming that the goal is to approximate the Pareto-optimal set. It proposes the Set Preference Algorithm for Multiobjective Optimization (SPAM) the working principle of which is based on two observations: (i) current multiobjective evolutionary algorithms (MOEAs) can be...
متن کاملInteractive Fuzzy Modeling by Evolutionary Multiobjective Optimization with User Preference
One of the new trends in genetic fuzzy systems (GFS) is the use of evolutionary multiobjective optimization (EMO) algorithms. This is because EMO algorithms can easily handle two conflicting objectives (i.e., accuracy maximization and complexity minimization) when we design accurate and compact fuzzy rule-based systems from numerical data. Since the main advantage of fuzzy rule-based systems co...
متن کاملHypervolume-Based Search for Multiobjective Optimization: Theory and Methods
xi Zusammenfassung xiii Statement of Contributions xv Acknowledgments xvii List of Symbols and Abbreviations xvii Introduction . Introductory Example . . . . . . . . . . . . . . . . . . . . . . . . .. Multiobjective Problems . . . . . . . . . . . . . . . . . . . .. Selecting the Best Solutions . . . . . . . . . . . . . . . . . .. The Hypervolume Indicator . . . . . . . . . ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2011